package main.java.indi.zyj.c150.dp;

public class _11_MinPathSum {


    public int minPathSum(int[][] grid) {
        int[][] dp = new int[grid.length][grid[0].length];
        dp[0][0] = grid[0][0];
        // 初始化
        for (int i = 1;i<grid.length;i++) {
            dp[i][0] = grid[i][0] + dp[i-1][0];
        }

        for (int i = 1;i<grid[0].length;i++) {
            dp[0][i] = grid[0][i] + dp[0][i-1];
        }
        for (int i = 1;i<grid.length;i++) {
            for (int j=1;j<grid[0].length;j++) {
                dp[i][j] = Math.min(dp[i-1][j], dp[i][j-1]) + grid[i][j];
            }
        }
        return dp[grid.length-1][grid[0].length -1 ];

    }

}
